Computing the Widest Empty Boomerang
نویسندگان
چکیده
In this paper we consider the following obnoxious facility location problem: given a set S of n points in the plane, and two special points a and b, find the 1-corner polygonal chain (also known as boomerang) connecting a and b such that its minimum distance to S is maximized. In other words: find the widest empty polygonal chain of two edges having extremes anchored at a and b. We present a new O(n log n) algorithm which improves the previous O(n) result [3].
منابع مشابه
On finding widest empty curved corridors
An α-siphon of width w is the locus of points in the plane that are at the same distance w from a 1-corner polygonal chain C such that α is the interior angle of C. Given a set P of n points in the plane and a fixed angle α, we want to compute the widest empty α-siphon that splits P into two non-empty sets. We present an efficient O(n log n)-time algorithm for computing the widest oriented α-si...
متن کاملOn finding a widest empty 1-corner corridor
A 1-corner corridor through a set S of points is an open subset of CH(S) containing no points from S and bounded by a pair of parallel polygonal lines each of which contains two segments. Given a set of n points in the plane, we consider the problem of computing a widest empty 1-corner corridor. We describe an algorithm that solves the problem in O(n4 logn) time and O(n) space. We also present ...
متن کاملWidest-corridor Problems
A k-dense corridor through a finite set, S, of n points in the plane is the open region of the plane that is bounded by two parallel lines that intersect the convex hull of S and such that the region contains k points of S. The problem of finding a widest k-dense corridor arises in robot motion-planning. In this paper, efficient solutions are presented for several versions of this problem. Resu...
متن کاملAn optimization model for management of empty containers in distribution network of a logistics company under uncertainty
In transportation via containers, unbalanced movement of loaded containers forces shipping companies to reposition empty containers. This study addresses the problem of empty container repositioning (ECR) in the distribution network of a European logistics company, where some restrictions impose decision making in an uncertain environment. The problem involves dispatching empty contain...
متن کاملThe Boomerang White Paper: A Page as You Like It
Boomerang is a dynamic HTML page recon guration system. A user accesses Boomerang via the Common Gateway Interface. The user supplies a page name and a template, Boomerang fetches the requested page and uses the template to recon gure it. The template is a sequence of string manipulation rules. The rules are written in a simple regular expression-based pattern matching language. Boomerang also ...
متن کامل